eOMP: Finding Sparser Representation by Recursively Orthonormalizing the Remaining Atoms

نویسندگان

  • Yuanyi Xue
  • Yao Wang
چکیده

Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations y and the redundant dictionary Φ, one would seek the most sparse coefficient (signal) x with a constraint on approximation fidelity. In this work, we propose a greedy algorithm based on the classic orthogonal matching pursuit (OMP) with improved sparsity on x and better recovery rate, which we name as eOMP. The key ingredient of the eOMP is recursively performing one-step orthonormalization on the remaining atoms, and evaluating correlations between residual and orthonormalized atoms. We show a proof that the proposed eOMP guarantees to maximize the residual reduction at each iteration. Through extensive simulations, we show the proposed algorithm has better exact recovery rate on i.i.d. Gaussian ensembles with Gaussian signals, and more importantly yields smaller L0-norm under the same approximation fidelity compared to the original OMP, for both synthetic and practical scenarios. The complexity analysis and real running time result also show a manageable complexity increase over the original OMP. We claim that the proposed algorithm has better practical perspective for finding more sparse representations than existing greedy algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EOMP: an exactly once multicast protocol for distributed mobile systems

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...

متن کامل

A Novel Image Denoising Method Based on Incoherent Dictionary Learning and Domain Adaptation Technique

In this paper, a new method for image denoising based on incoherent dictionary learning and domain transfer technique is proposed. The idea of using sparse representation concept is one of the most interesting areas for researchers. The goal of sparse coding is to approximately model the input data as a weighted linear combination of a small number of basis vectors. Two characteristics should b...

متن کامل

Model-based Matching Pursuit - Estimation of Chirp Factors and Scale of Gabor Atoms with Iterative Extension

By definition, the Matching Pursuit algorithm with constant (or “flat”) Gabor atoms provides a coarse estimate of frequency modulated sinusoids in music and voice signals. Chirped Gabor atoms, closer to the nature of these signals, would fit them in a finer and sparser way. Though a method for the direct analytic estimation of chirped Gabor atoms has been proposed in the past [1], the present a...

متن کامل

Speckle reduction in optical coherence tomography images based on wave atoms.

Optical coherence tomography (OCT) is an emerging noninvasive imaging technique, which is based on low-coherence interferometry. OCT images suffer from speckle noise, which reduces image contrast. A shrinkage filter based on wave atoms transform is proposed for speckle reduction in OCT images. Wave atoms transform is a new multiscale geometric analysis tool that offers sparser expansion and bet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1502.03805  شماره 

صفحات  -

تاریخ انتشار 2015